Subtyping Object and Recursive Types Logically
نویسندگان
چکیده
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown that equality in the full first order ς-calculus is modelled by this notion, which on turn is included in a Morris style contextual equivalence.
منابع مشابه
A Complete Type Inference System for Subtyped Recursive Types
Since record polymorphism is one of essential factors for object-oriented languages, various approaches to incorporate record polymorphism into type systems have been proposed to lay the foundation for object-oriented languages. Recursive types, which are essentially types of lists or trees, are major programming tools. In object-oriented languages, a pseudo variable \self" has a recursive type...
متن کاملInterpretations of Extensible Objects and Types
We present a type-theoretic encoding of extensible objects and types. The ambient theory is a higher-order-calculus with poly-morphic types, recursive types and operators, and subtyping. Using this theory, we give a type preserving and computationally adequate translation of a full-edged object calculus that includes object extension and override. The translation specializes to calculi of nonex...
متن کاملSubtyping Recursive Games
Using methods drawn from Game Semantics, we build a sound and computationally adequate model of a simple calculus that includes both subtyping and recursive types. Our model solves recursive type equations up to equality, and is shown to validate a subtyping rule for recursive types proposed by Amadio and Cardelli.
متن کاملType Inference with Simple Selftypes is NP-complete
The metavariable self is fundamental in object-oriented languages. Typing self in the presence of inheritance has been studied by Abadi and Cardelli, Bruce, and others. A key concept in these developments is the notion of selftype, which enables flexible type annotations that are impossible with recursive types and subtyping. Bruce et al. demonstrated that, for the language TOOPLE, type checkin...
متن کاملA On Subtyping-Relation Completeness, with an Application to Iso-Recursive Types
Well-known techniques exist for proving the soundness of subtyping relations with respect to type safety. However, completeness has not been treated with widely applicable techniques, as far as we’re aware. This paper develops techniques for stating and proving that a subtyping relation is complete with respect to type safety and applies the techniques to the study of iso-recursive subtyping. A...
متن کامل